Concurrency and Probability: Removing Confusion, Compositionally

نویسندگان

  • Roberto Bruni
  • Hernán C. Melgratti
  • Ugo Montanari
چکیده

Assigning a satisfactory truly concurrent semantics to Petri nets with confusion and distributed decisions is a long standing problem, especially if one wants to fully replace nondeterminism with probability distributions and no stochastic structure is desired/allowed. Here we propose a general solution based on a recursive, static decomposition of (finite, occurrence) nets in loci of decision, called structural branching cells (s-cells). Each scell exposes a set of alternatives, called transactions, that can be equipped with a general probabilistic distribution, i.e., as desired, nondeterminism can be entirely replaced by probability. The solution is formalised as a transformation from a given Petri net to another net whose transitions are the transactions of the s-cells and whose places are the places of the original net, with some auxiliary structure for bookkeeping. The resulting net is confusion-free, namely if a transition is enabled, then all its conflicting alternatives are also enabled. Thus sets of conflicting alternatives can be equipped with probability distributions, while nonintersecting alternatives are purely concurrent and do not introduce any nondeterminism: they are Church-Rosser and their probability distributions are independent. The validity of the construction is witnessed by a tight correspondence result with the recent approach by Abbes and Benveniste (AB) based on recursively stopped configurations in event structures. Some advantages of our approach over AB’s are that: i) s-cells are defined statically and locally in a compositional way, whereas AB’s branching cells are defined dynamically (by executing the event structure) and globally (by manipulating the entire event structure); ii) their recursively stopped configurations correspond to possible executions, but the existing concurrency is not made explicit. Instead, our resulting nets are equipped with an original concurrency structure exhibiting a so-called complete concurrency property.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic models for true-concurrency: branching cells and distributed probabilities for event structures

This paper is devoted to true-concurrency models for probabilistic systems. By this we mean probabilistic models in which Mazurkiewicz traces, not interleavings, are given a probability. Here we address probabilistic event structures. We consider a new class of event structures, called locally finite. Locally finite event structures exhibit “finite confusion”; in particular, under some mild con...

متن کامل

Probabilistic True-Concurrency Models Branching Cells and Distributed Probabilities for Event Structures

This paper is devoted to true-concurrency models for probabilistic systems. By this we mean probabilistic models in which Mazurkiewicz traces, not interleavings, are given a probability. Here we address probabilistic event structures. We consider a new class of event structures, called locally finite. Locally finite event structures exhibit “finite confusion”; in particular, under some mild con...

متن کامل

Possible values: Exploring a concept for concurrency

An important issue in concurrency is interference. This issue manifests itself in both shared-variable and communication-based concurrency — this paper focusses on the former case where interference is caused by the environment of a process changing the values of shared variables. Rely/guarantee approaches have been shown to be useful in specifying and reasoning compositionally about concurrent...

متن کامل

Permission-Based Separation Logic for Message-Passing Concurrency

We develop local reasoning techniques for message passing concurrent programs basedon ideas from separation logics and resource usage analysis. We extend processes with permission-resources and define a reduction semantics for this extended language. This provides a foundationfor interpreting separation formulas for message-passing concurrency. We also define a sound proofsystem...

متن کامل

Concurrency, Σ-algebras, and Probabilistic Fairness Concurrency, Σ-algebras, and Probabilistic Fairness

We extend previous constructions of probabilities for a prime event structure E by allowing arbitrary confusion. Our study builds on results related to fairness in event structures that are of interest per se. Executions of E are captured by the set Ω of maximal configurations. We show that the information collected by observing only fair executions of E is confined in some σ-algebra F0, contai...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1710.04570  شماره 

صفحات  -

تاریخ انتشار 2017